ar X iv : c s / 01 11 05 3 v 2 [ cs . C C ] 2 7 A ug 2 00 2 Meaningful Information
نویسنده
چکیده
The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the object and the information accounting for the remaining accidental information. There can be several ways (model classes) in which the regularity is expressed. Kolmogorov has proposed the model class of finite sets, generalized later to computable probability mass functions. The resulting theory, known as Algorithmic Statistics, analyzes the algorithmic sufficient statistic when the statistic is restricted to the given model class. However, the most general way to proceed is perhaps to express the useful information as a recursive function. The resulting measure has been called the " sophistication " of the object. We develop the theory of recursive functions statistic, the maximum and minimum value, the existence of absolutely nonstochastic objects (that have maximal sophistication—all the information in them is meaningful and there is no residual randomness), determine its relation with the more restricted model classes of finite sets, and computable probability distributions, in particular with respect to the algorithmic (Kolmogorov) minimal sufficient statistic, the relation to the halting problem and further algorithmic properties.
منابع مشابه
ar X iv : m at h / 05 01 13 9 v 2 [ m at h . FA ] 1 A ug 2 00 5 Stability of Adjointable Mappings in Hilbert C ∗ - Modules ∗
The generalized Hyers–Ulam–Rassias stability of adjointable mappings on Hilbert C∗-modules is investigated. As a corollary, we establish the stability of the equation f(x)∗y = xg(y)∗ in the context of C∗-algebras.
متن کاملar X iv : c s / 05 11 02 3 v 2 [ cs . L O ] 5 N ov 2 00 5 Verifying nondeterministic probabilistic channel systems against ω - regular linear - time properties
متن کامل
ar X iv : m at h / 01 05 07 3 v 2 [ m at h . C O ] 2 A ug 2 00 1 COUNTING OCCURRENCES OF 132 IN A PERMUTATION
We study the generating function for the number of permutations on n letters containing exactly r > 0 occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S2r . 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 05C90
متن کاملar X iv : c s / 06 08 05 9 v 1 [ cs . L O ] 1 4 A ug 2 00 6 A Distribution Law for CCS and a New Congruence Result
We give an axiomatisation of strong bisimilarity on a small fragment of CCS that does not feature the sum operator. This axiomatisation is then used to derive congruence of strong bisimilarity in the finite π-calculus in absence of sum. To our knowledge, this is the only nontrivial subcalculus of the π-calculus that includes the full output prefix and for which strong bisimilarity is a congruence.
متن کاملar X iv : c s / 05 11 04 3 v 2 [ cs . C R ] 7 D ec 2 00 5 Poseidon : a 2 - tier Anomaly - based Network Intrusion Detection System ∗
We present Poseidon, a new anomaly based network intrusion detection system. Poseidon is payload-based, and has a two-tier architecture: the first stage consists of a Self-Organizing Map, while the second one is a modified PAYL system [30]. Our benchmarks on the 1999 DARPA data set [22] show a higher detection rate and lower number of false positives than PAYL and PHAD.
متن کامل